Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times

نویسندگان

چکیده

Stochastic, as well fuzzy uncertainty, can be found in most real-world systems. Considering both types of uncertainties simultaneously makes optimization problems incredibly challenging. In this paper we propose a simheuristic to solve the Time Capacitated Arc Routing Problem (TCARP) when nature travel time either deterministic, stochastic or fuzzy. The main goal is find solution (vehicle routes) that minimizes total spent servicing required arcs. However, due other characteristics are also considered. particular, illustrate how reliability concepts enrich probabilistic information given decision-makers. order aforementioned problem, extend concept framework so it include elements. Hence, and uncertainty incorporated into CARP. test our approach, classical CARP instances have been adapted extended customers' demands become experimental results show effectiveness proposed approach compared with more traditional ones. capable generating new best-known solutions for versions some belonging tegl, tcarp, val, rural benchmarks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling and Solving the Vehicle Routing Problem with Stochastic Travel Times and Hard Time Windows

In practically all real-world planning and scheduling problems one is faced with uncertainty. Usually this uncertainty is abstracted away during the modeling process, such that standard combinatorial optimization algorithms can be used to solve the problem. This abstraction step is necessary, because these algorithms generally cannot deal with uncertainty. In this thesis we study the Vehicle Ro...

متن کامل

Solving a multi-depot location-routing problem with heterogeneous vehicles and fuzzy travel times by a meta-heuristic algorithm

A capacitated location-routing problem (CLRP) is one of the new areas of research in distribution management. It consists of two problems; locating of facilities and routing of the vehicle with a specific capacity. The purpose of the CLRP is to open a set of stores, allocate customers to established deposits, and then design vehicle tours in order to minimize the total cost. In this paper, a ne...

متن کامل

Model and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand

The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...

متن کامل

Vehicle routing problem with stochastic travel times including soft time windows and service costs

This paper studies a vehicle routing problem with soft time windows and stochastic travel times. A model is developed that considers both transportation costs (total distance traveled, number of vehicles used and drivers’ total expected overtime) and service costs (early and late arrivals). We propose a Tabu Search method to solve this model. An initialization algorithm is developed to construc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Networks

سال: 2023

ISSN: ['0028-3045', '1097-0037']

DOI: https://doi.org/10.1002/net.22159